definition tree
英 [ˌdefɪˈnɪʃn triː]
美 [ˌdefɪˈnɪʃn triː]
网络 定义树
双语例句
- A JiBX binding definition is a third tree that represents a merger of the structure of the XML and object trees ( which, in JiBX, can be different).
JiBX绑定定义是第三棵树，它表示XML树和对象树（在JiBX中，它们可以不同）结构的合并。 - You can clone objects such as tables, views, stored procedures, and functions using the Clone Definition context menu that is available on these nodes in the Server Explorer tree.
您可以在ServerExplorer树中使用节点中的CloneDefinition上下文菜单克隆表、视图、存储过程、函数等对象。 - The definition files for the Perspective, the Navigation Tree, the Collection View, the Detail View, and the View Query were created for the Viewer perspective.
为查看者透视图创建了透视图、导航树、集合视图、详细信息视图和视图查询的定义文件。 - In this paper, we give the two approaches of the definition of XML functional dependency, in which one is based on tree tuples and the other is based on path.
本文给出了基于树元组的XML函数依赖和基于路径的XML函数依赖的两种定义方法。 - The program abstract the finite cover system of 3D NMM as independent data classes, and give the definition and implement of the classes, and manage these data classes by techniques of tree structure.
程序将三维数值流形方法的有限覆盖系统抽象为一些独立的数据类，给出了类的描述和它们的实现方法，并用树状结构对这些数据类进行管理。 - Additionally, flexible definition based on chain and hiberarchy was proposed and corresponding coding system had been developed, which implemented auto-coding of parts through coding tree.
建立了面向大批量定制设计的柔性分类编码体系，提出了基于链式与层次结构的柔性化定义，开发了相应的编码管理系统，通过编码树实现了零部件的自动编码。 - The definition involves element data type, value confine, measurement unit, concept term, arbor code, score, role prosperity and trigger of child node in the arbor tree.
定义的内容包括元素的数据类型，取值范围，计量单位，概念术语，树状编码，分值，角色属性，以及树结构的子节点触发器。 - This paper analyses the definition of the DDGRAPH diagram and related concept, improves the method of designing the DDGRAPH diagram and the dominated tree, implied tree, unconstrained arc.
该文通过对DDGRAPH图的定义及相关概念的分析，对构建DDGRAPH图及支配树、蕴含树、非限制弧的方法进行了改进。 - According to the definition of data source by users, the system can extract data from the database or data warehouse, clean the data, induct a tree and a set of rules and make classification or prediction about the unknown-classed data.
该系统可以根据用户对数据源的定义自动抽取数据、清理数据、生成决策树及其规则并对未知类别的数据进行预测。 - In this paper, a mathematical definition of decision tree classifier is given.
本文从理论上给出了树分类器的数学定义，探讨了分类树的优化和性能评价函数这两个关键问题。 - The definition of the reflection source and diffraction source in the tree structure makes the ray tracing course more simple and efficient. Furthermore, the original source and receiving point are also added to the tree structure.
该方法通过在树结构中定义反射源、绕射源，从而使整个射线跟踪过程更便捷高效，并且辐射源和接受点也被添加进树结构。 - In this paper, the SQL ( D) data model based on the relational database is presented, which gives the formal definition of hierarchy tree, hierarchy chain and dimension. The unbalance and heterogeneity of dimension hierarchy are permitted in this model.
为此，提出了一个基于关系数据库的SQL（D）数据模型，它给出了层次链、层次树、维的正式定义，支持不平衡、异构的维层次结构； - Definition and traversing of tree
树的定义及遍历 - After giving the definition of layer 3 switching, VLAN technology based on 802.1Q, spanning tree protocol and multi link trunking are discussed, and their application policies are presented in this paper.
讨论了第三层交换的概念、基于802.1Q标准的VLAN技术、生成树协议（STP）和多链路干线（MLT）技术，指出了各种技术的应用策略。 - Basic concepts and definition of suspended tree and extended contour are given, an algorithm to extract it is presented using techniques of dynamic local coordinate system and adaptive bounding box.
文中提出了悬树和扩展轮廓的概念，通过对扩展轮廓的分析和定义，使用动态坐标系和动态包围盒技术，设计了一个扩展轮廓的求取算法。 - Based on a set of matrix definition and formulae, the matrixing method using analysis tree for boolean expression deduction is presented.
矩阵运算在计算机上是易于实现的，因此，提出了一整套的矩阵定义和运算规则，并利用布尔表达式的分析树，实现了布尔代数演绎的矩阵化方法。 - According to the definition of ambient calculus, we propose the concept of ambient syntactic structure tree, and introduce a data flow analysis method for ambient calculus based on the structural tree of ambient calculus and the implementation of the analysis algorithms.
针对Ambient演算的定义，提出了Ambient演算语法结构树的概念，并且给出一个基于Ambient语法结构树的Ambient演算的数据流分析方法及其实现。 - The other is based on tree formation in which the definition of fuzzy rule tree is presented.
另一类是基于树型结构的模糊推理规则的抽取方法，同时给出了模糊规则树的定义。 - Firstly formal definition of Input/ Output Dependency AND/ OR Tree is proposed, furthermore described searching algorithm to built Input/ Output Dependency AND/ OR Tree, including basic AND/ OR tree search algorithm and special algorithm.
首先给出了输入/输出依赖与/或树的形式化定义，进而讨论了构建输入/输出依赖与/或树的搜索算法，包括基本的与/或树搜索算法及针对Web服务组合的搜索策略。 - We discussed the applications of automata theory in the XML data processing. By extending the definition of DTD and tree automata, integrity constraint and functional dependency are introduced into query processing. The documents filter matching can be completed in one-pass scanning. 2.
研究了自动机理论在XML数据处理中的应用，通过扩展DTD及树自动机的定义，将完整性约束及函数依赖引入查询处理，能够实现在一遍扫描的条件下，完成文档流的过滤匹配。 - And we give the inductive definition of attribute dependencies induced in the syntactic attributed tree.
和给出了在HPSG句法结构树上归纳的属性依存关系的递归定义。 - Based on the definition of similarity between multicast trees ( groups) and the asymmetric characteristic of similarity, the heuristic information of the initial tree selection stage and the tree aggregation stage were proposed according to the combination of similarity and similarity rank.
定义了组播树（组播组）的相似性，分析了相似性的不对称特征，提出使用相似度和相似性排名的组合来确定初始树选择阶段和树聚合阶段的启发式信息。 - After introduction of the working principle of synchronous sequential circuits, as well as clock skew and jitter definition, and clock tree definition, structure and comparison of three ways of CTS, it mentions the importance of timing constraints files.
在时钟树综合部分，主要介绍同步时序电路工作原理，以及时钟偏差和时钟抖动的定义，时钟树的定义、结构和综合方式的比较，最后提到时序约束文件的重要性。 - At the commencement, we give the definition and prove several theoretical properties of multivariate Polya tree priors, accompanied with data structure and model assumptions.
首先我们给出多元Polyatree先验的定义和理论性质，然后提出相应的数据结构和模型假设。 - In the thesis, a definition of CD-Tree is given, related algorithms, such as tree construction, node deletion and tree merge, are developed, and the time complexity of the algorithms is analyzed and compared with other structures.
文中给出了CD-Tree详细定义，设计了CD-Tree的构建、节点删除、树合并等相关算法，分析了CD-Tree相关算法的时间复杂度，并与其它存储结构的时间复杂度进行了对比。